package ds.tree;

public class InOrderSuccessor {

	private TreeNode temp = null;
	
	private static class TreeNode{
		int value;
		TreeNode left = null;
		TreeNode right = null;
		TreeNode successor = null;
		
		TreeNode(int val){
			this.value = val;
		}
		
		public String toString(){
			return String.valueOf(value);
		}
	}
	public void inOrderTraversal(TreeNode node){
		
		if(node == null){
			return;
		}

		inOrderTraversal(node.right);
		node.successor = temp;
		temp = node;

		inOrderTraversal(node.left);
	}
	private static TreeNode tree(){
		TreeNode A = new TreeNode(1);
		TreeNode B = new TreeNode(2);
		TreeNode C = new TreeNode(3);
		TreeNode D = new TreeNode(4);
		TreeNode E = new TreeNode(5);
		TreeNode F = new TreeNode(6);
		TreeNode G = new TreeNode(7);
		
		A.left = B;
		A.right = C;
		B.left = D;
		B.right = E;
		C.left = F;
		C.right = G;
		
		return A;
	}

	public static void main(String[] args) {
		InOrderSuccessor inOrderSuccessor = new InOrderSuccessor();
		TreeNode node = tree();
		inOrderSuccessor.inOrderTraversal(node);
		node = node.left.left;
		while(node != null){
			System.out.print(node.value + " ");
			node = node.successor;
		}
	}

}
